Bases for structures and permutation groups
نویسنده
چکیده
Bases, determining sets, metric dimension, . . . The notion of a base, and various combinatorial variants on it, have been rediscovered many times in different parts of combinatorics, especially graph theory: base size has been called fixing number, determining number, rigidity index, etc. Robert Bailey and I have written a survey paper attempting to describe all these and related concepts and results:
منابع مشابه
The remoteness of the permutation code of the group $U_{6n}$
Recently, a new parameter of a code, referred to as the remoteness, has been introduced.This parameter can be viewed as a dual to the covering radius. It is exactly determined for the cyclic and dihedral groups. In this paper, we consider the group $U_{6n}$ as a subgroup of $S_{2n+3}$ and obtain its remoteness. We show that the remoteness of the permutation code $U_{6n}$ is $2n+2$. Moreover, ...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...
متن کاملSome measures of finite groups related to permutation bases
I define three “measures” of the complicatedness of a finite group in terms of bases in permutation representations of the group, and consider their relationships to other measures.
متن کاملUncoverings-by-bases for base-transitive permutation groups
An uncovering-by-bases for a group G acting on a finite set Ω is a set U of bases forG such that any r-subset of Ω is disjoint from at least one base in U, where r is a parameter dependent on G. They have applications in the decoding of permutation groups when used as error-correcting codes, and are closely related to covering designs. We give constructions for uncoverings-by-bases for many fam...
متن کاملBases for Primitive Permutation Groups and a Conjecture of Babai
A base of a permutation group G is a sequence B of points from the permutation domain such that only the identity of G fixes B pointwise. We show that primitive permutation groups with no alternating composition factors of degree greater than d and no classical composition factors of rank greater than d have a base of size bounded above by a function of d. This confirms a conjecture of Babai. Q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010